A comparison of smoothers for state- constrained optimal control problems
نویسنده
چکیده
O ptimal control problems governed by partial differential equations with state constraints are considered. The state constraints are treated by two types of regularization techniques, namely the Lavrentiev type and the Moreau-Yosida type regularization. For the realization of the numerical solution, a multigrid method is applied to the regularized problems. The main purpose of this research is to compare smoothing procedures for solving state-constrained optimal control problems. Results of numerical experiments show the computational performance of both smoothing strategies.
منابع مشابه
Equivalent a posteriori error estimates for spectral element solutions of constrained optimal control problem in one dimension
In this paper, we study spectral element approximation for a constrained optimal control problem in one dimension. The equivalent a posteriori error estimators are derived for the control, the state and the adjoint state approximation. Such estimators can be used to construct adaptive spectral elements for the control problems.
متن کاملThe Exact Solution of Min-Time Optimal Control Problem in Constrained LTI Systems: A State Transition Matrix Approach
In this paper, the min-time optimal control problem is mainly investigated in the linear time invariant (LTI) continuous-time control system with a constrained input. A high order dynamical LTI system is firstly considered for this purpose. Then the Pontryagin principle and some necessary optimality conditions have been simultaneously used to solve the optimal control problem. These optimality ...
متن کاملSolution of Bang-Bang Optimal Control Problems by Using Bezier Polynomials
In this paper, a new numerical method is presented for solving the optimal control problems of Bang-Bang type with free or fixed terminal time. The method is based on Bezier polynomials which are presented in any interval as $[t_0,t_f]$. The problems are reduced to a constrained problems which can be solved by using Lagrangian method. The constraints of these problems are terminal state and con...
متن کاملPatch Smoothers for Saddle Point Problems with Applications to PDE-Constrained Optimization Problems
We consider a multigrid method for solving the discretized optimality system of a PDE-constrained optimization problem. In particular, we discuss the construction of an additive Schwarz-type smoother for a class of elliptic optimal control problems. A rigorous multigrid convergence analysis yields level-independent convergence rates. Numerical experiments indicate that the convergence rates are...
متن کاملConstrained Nonlinear Optimal Control via a Hybrid BA-SD
The non-convex behavior presented by nonlinear systems limits the application of classical optimization techniques to solve optimal control problems for these kinds of systems. This paper proposes a hybrid algorithm, namely BA-SD, by combining Bee algorithm (BA) with steepest descent (SD) method for numerically solving nonlinear optimal control (NOC) problems. The proposed algorithm includes th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014